singly linked

См. также в других словарях:

• singly linked list — vienkryptis sąrašas statusas T sritis informatika apibrėžtis ↑Susietasis sąrašas, kurio elementai sujungti rodyklėmis viena kryptimi, pradedant pirmuoju elementu. Iliustraciją žr. priede. Dažniausiai vartojami vienkrypčiai sąrašai, todėl gali… …   Enciklopedinis kompiuterijos žodynas

• Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …   Wikipedia

• Doubly linked list — In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the… …   Wikipedia

• Lista (informática) — En Ciencias de la Computación, una lista enlazada es una de las estructuras de datos fundamentales, y puede ser usada para implementar otras estructuras de datos. Consiste en una secuencia de nodos, en los que se guardan campos de datos… …   Wikipedia Español

• VList — In computer science, the VList is a persistent data structure designed by Phil Bagwell in 2002 that combines the fast indexing of arrays with the easy extension of cons based (or singly linked) linked lists. [ Citation | title=Fast Functional… …   Wikipedia

• List (computing) — In computer science, a list is an ordered collection of entities/items. In the context of object oriented programming languages, a list is defined as an instance of an abstract data type (ADT), formalizing the concept of an ordered collection of… …   Wikipedia

• Persistent data structure — In computing, a persistent data structure is a data structure which always preserves the previous version of itself when it is modified; such data structures are effectively immutable, as their operations do not (visibly) update the structure in… …   Wikipedia

• Bin (computational geometry) — In computational geometry, the bin data structure allows efficient region queries, i.e., if there are some axis aligned rectangles on a 2D plane, answer the question Given a query rectangle, return all rectangles intersecting it . kd tree is… …   Wikipedia

• CAR and CDR — Introduced in the Lisp programming language, car (pronEng|ˈkɑr, just like the English word car ) and cdr (IPA|/ˈkʌdər/ or IPA|/ˈkʊdər/) are primitive operations upon linked lists composed of cons cells. A cons cell is composed of two pointers;… …   Wikipedia

• Microsoft interview — The Microsoft interview is a job interview technique used by Microsoft to assess possible future Microsoft employees. It is significant because Microsoft s model was pioneering, and later picked up and developed by other companies including… …   Wikipedia

• Lisp (programming language) — Infobox programming language name = Lisp paradigm = multi paradigm: functional, procedural, reflective generation = 3GL year = 1958 designer = John McCarthy developer = Steve Russell, Timothy P. Hart, and Mike Levin latest release version =… …   Wikipedia